Circle graph obstructions under pivoting

نویسندگان

  • James F. Geelen
  • Sang-il Oum
چکیده

A circle graph is the intersection graph of a set of chords of a circle. The class of circle graphs is closed under pivotminors. We determine the pivot-minor-minimal non-circle-graphs; there 15 obstructions. These obstructions are found, by computer search, as a corollary to Bouchet’s characterization of circle graphs under local complementation. Our characterization generalizes Kuratowski’s Theorem.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Isotropic Matroids II: Circle Graphs

We present several characterizations of circle graphs, which follow from Bouchet’s circle graph obstructions theorem.

متن کامل

Partial Characterizations of Circle Graphs

A circle graph is the intersection graph of a family of chords on a circle. There is no known characterization of circle graphs by forbidden induced subgraphs that do not involve the notions of local equivalence or pivoting operations. We characterize circle graphs by a list of minimal forbidden induced subgraphs when the graph belongs to one of the following classes: linear domino graphs, P4-t...

متن کامل

$Z_k$-Magic Labeling of Some Families of Graphs

For any non-trivial abelian group A under addition a graph $G$ is said to be $A$-textit{magic}  if there exists a labeling $f:E(G) rightarrow A-{0}$ such that, the vertex labeling $f^+$  defined as $f^+(v) = sum f(uv)$ taken over all edges $uv$ incident at $v$ is a constant. An $A$-textit{magic} graph $G$ is said to be $Z_k$-magic graph if the group $A$ is $Z_k$  the group of integers modulo $k...

متن کامل

Computing Planar Intertwines

The proof of Wagner's Conjecture by Robertson and Seymour gives a nite description of any family of graphs which is closed under the minor ordering. This description is a nite set of graphs called the obstructions of the family. Since the intersection and the union of two minor closed graph families is again a minor closed graph family, an interesting question is that of computing the obstructi...

متن کامل

Managing the Complexity of Lookahead for LU Factorization with Pivoting∗ FLAME Working Note #40

We describe parallel implementations of LU factorization with pivoting for multicore architectures. Implementations that differ in two different dimensions are discussed: (1) using classical partial pivoting versus recently proposed incremental pivoting and (2) extracting parallelism only within the Basic Linear Algebra Subprograms versus building and scheduling a directed acyclic graph of task...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Journal of Graph Theory

دوره 61  شماره 

صفحات  -

تاریخ انتشار 2009